Structure and Returns to Scale of Real-Time Hierarchical Resource Allocation

نویسنده

  • Timothy Van Zandt
چکیده

Companion papers develop a model of real-time hierarchical computation of resource allocations by boundedly rational members of an administrative staff. The nodes of a hierarchy are multiperson decision-making units offices. The current paper uses a reduced form to address specific questions about organizational structure and returns to scale. We find that the possibility of decentralizing decision making within these hierarchical organizations allows for larger hierarchies. However, organization size is still bounded because the combined effect of cumulative delay and administrative costs means that in large enough hierarchies, the value of the root office’s information processing is less than the office’s administrative costs. We also find that as the environment changes more rapidly, optimal hierarchies become smaller and more internally decentralized. A speed-up of managerial processing, such as through improved information technology, has the opposite effect. JEL Classifications: D83, D23

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-Time Hierarchical Resource Allocation with Quadratic Costs

This paper presents a model in which resource allocation are calculated in real-time by boundedly rational members of an administrative staa. We consider a class of hierarchical procedures in which information about cost functions ows up and is aggregated by a hierarchy, while allocations ow down and are disag-gregated by the hierarchy. We assume that the cost functions are quadratic and that t...

متن کامل

Real-Time Hierarchical Resource Allocation with Quadratic Payoffs

This paper presents a model in which resource allocations are calculated in real time by boundedly rational members of an administrative staff. We consider a class of hierarchical procedures in which information about payoff functions flows up and is aggregated by a hierarchy, while allocations flow down and are disaggregated by the hierarchy with decentralized decision making. We assume that t...

متن کامل

Preliminary { Incomplete { InconsistentStructure and Returns to Scale ofReal - Time Hierarchical Resource

Companion papers develop a model of real-time hierarchical computation of resource allocations by boundedly rational members of an administrative staa. The nodes of a hierarchy are ooces within which information processing may be decentralized. Decision making is decentralized across the nodes of the hierarchy. A version in which the cost functions are quadratic and the cost parameters follow r...

متن کامل

Constrained consumable resource allocation in alternative stochastic networks via multi-objective decision making

Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...

متن کامل

Hierarchical computation of the resource allocation problem

Some recent research on information processing in organizations has treated the agents who process information as endogenous. This paper discusses a sample of models in this area, which differ in their methodology but are unified by the fact that they study the resource allocation problem. Computational constraints are related to the structure and returns to scale of hierarchies.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003